On the invariance of the set of Core matchings with respect to preference profiles

نویسندگان

  • Ruth Martínez
  • Jordi Massó
  • Alejandro Neme
  • Jorge Oviedo
چکیده

We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set of preference pro…les into subsets with the property that all preference pro…les in the same subset have the same Core. We also show how to identify a pro…le of (incomplete) binary relations containing the minimal information needed to generate as strict extensions all the (complete) preference pro…les with the same Core. This is important for applications since it reduces the amount of information that agents have to reveal about their preference relations to centralized Core matching mechanisms; moreover, this reduction is maximal. Keywords: Matching, Core. Journal of Economic Literature Classi…cation Number: C78. We are very grateful to Flip Klijn for his helpful comments. We also thank members of the Bag Lunch Workshop on Game Theory and Social Choice at Universitat Autònoma de Barcelona for comments and suggestions. The work of R. Martínez, A. Neme, and J. Oviedo is partially supported by the Universidad Nacional de San Luis through grant 319502 and by the Consejo Nacional de Investigaciones Cientí…cas y Técnicas through grant PICT-02114. Support for the research of J. Massó was received through the prize “ICREA Acadèmia” for excellence in research, funded by the Generalitat de Catalunya. He also acknowledges the support of the Barcelona Graduate School of Economics, where he is an a¢ liated professor, through its Research Recognition Programme. His work is also supported by the Spanish Ministry of Science and Innovation through grants ECO2008-04756 (Grupo Consolidado-C) and CONSOLIDER-INGENIO 2010 (CDS2006-00016), and by the Generalitat de Catalunya through grant SGR2009-419. yInstituto de Matemática Aplicada de San Luis. Universidad Nacional de San Luis and CONICET. Ejército de los Andes 950. 5700, San Luis, Argentina. E-mails: [email protected], [email protected], and [email protected] zDepartament d’Economia i d’Història Econòmica and CODE. Universitat Autònoma de Barcelona. 08193, Bellaterra (Barcelona), Spain. E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the invariance of the set of stable matchings with respect to substitutable preference profiles

For the many-to-one matching model we give a procedure to partition the set of substitutable preference profiles into equivalence classes with the property that all profiles in the same class have the same set of stablematchings. This partition allows to reduce the amount of information required by centralized stable mechanisms.

متن کامل

Global Forcing Number for Maximal Matchings under Graph Operations

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

متن کامل

Cooperative Benefit and Cost Games under Fairness Concerns

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

متن کامل

Complete forcing numbers of polyphenyl systems

The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...

متن کامل

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2012